Pumping Lemma for Higher-order Languages
نویسندگان
چکیده
We study a pumping lemma for the word/tree languages generated by higher-order grammars. Pumping lemmas are known up to order-2 word languages (i.e., for regular/context-free/indexed languages), and have been used to show that a given language does not belong to the classes of regular/context-free/indexed languages. We prove a pumping lemma for word/tree languages of arbitrary orders, modulo a conjecture that a higher-order version of Kruskal’s tree theorem holds. We also show that the conjecture indeed holds for the order-2 case, which yields a pumping lemma for order-2 tree languages and order-3 word languages. 1998 ACM Subject Classification F.4.3 Formal Languages
منابع مشابه
Strictness of the Collapsible Pushdown Hierarchy
We present a pumping lemma for each level of the collapsible pushdown graph hierarchy in analogy to the second author’s pumping lemma for higher-order pushdown graphs (without collapse). Using this lemma, we give the first known examples that separate the levels of the collapsible pushdown graph hierarchy and of the collapsible pushdown tree hierarchy, i.e., the hierarchy of trees generated by ...
متن کاملA Proof of the Pumping Lemma for Context-Free Languages Through Pushdown Automata
The pumping lemma for context-free languages is a result about pushdown automata which is strikingly similar to the well-known pumping lemma for regular languages. However, though the lemma for regular languages is simply proved by using the pigeonhole principle on deterministic automata, the lemma for pushdown automata is proven through an equivalence with context-free languages and through th...
متن کاملPumping Lemma and Ogden Lemma for Displacement Context-Free Grammars
The pumping lemma and Ogden lemma offer a powerful method to prove that a particular language is not context-free. In 2008 Kanazawa proved an analogue of pumping lemma for well-nested multiplecontext free languages. However, the statement of lemma is too weak for practical usage. We prove a stronger variant of pumping lemma and an analogue of Ogden lemma for the class of tree-adjoining language...
متن کاملFormalization of the pumping lemma for context-free languages
Context-free languages (CFLs) are highly important in computer language processing technology as well as in formal language theory. The Pumping Lemma is a property that is valid for all context-free languages, and is used to show the existence of non context-free languages. This paper presents a formalization, using the Coq proof assistant, of the Pumping Lemma for context-free languages.
متن کاملDiscrete Event Systems Solution to Exercise Sheet 3 1 Pumping Lemma [ Exam ]
a) Language L1 can be shown to be non-regular using the pumping lemma. Assume for contradiction that L1 is regular and let p be the corresponding pumping length. Choose w to be the word 01101. Because w is an element of L1 and has length more than p, the pumping lemma guarantees that w can be split into three parts, w = xyz, where |xy| ≤ p and for any i ≥ 0, we have xyz ∈ L1. In order to obtain...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017